Computing 2D Constrained Delaunay Triangulation Using the GPU
نویسندگان
چکیده
منابع مشابه
Computing 2D Constrained Delaunay Triangulation Using Graphics Hardware
This paper presents a novel approach, termed GPU-CDT, to compute the constrained Delaunay triangulation (CDT) for a planar straight line graph (PSLG), consisting of points and edges, using the graphics processing unit (GPU). Although there are many algorithms for constructing the 2D CDT using the CPU, there has been no known prior approach using the parallel computing power of the GPU efficient...
متن کاملGPU Implementation of the 2D Delaunay Triangulation
Delaunay triangulations have been well-studied and numerous implementations have been proposed and instantiated over the years, but it was not until recently (2008) that a method for computing the Delaunay triangulation has been performed on the GPU. Even still, it was still presented as a hybrid method, utilizing the CPU in conjunction with the GPU. The dual of the Delaunay triangulation, the ...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملOn recent advances in 2D Constrained Delaunay triangulation algorithms
In this article, recent works on 2D Constrained Delaunay triangulation(CDT) algorithms have been reported. Since the review of CDT algorithms presented by de Floriani(Issues on Machine Vision, Springer Vienna, pg. 95–104, 1989), different algorithms for construction and applications of CDT have appeared in literature each concerned with different aspects of computation and different suitabiliti...
متن کاملConstrained Delaunay Triangulation using Plane Subdivision
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage towards other algorithms is that I use an efficient Žalik’s algorithm, using a plane subdivison for obtaining a Delaunay triangulation. It is used for insertion of points into existing triangulation. The other part of algorithm presents a method for inserting edges, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2013
ISSN: 1077-2626
DOI: 10.1109/tvcg.2012.307